-
1 условные обозначения
-
2 условные обозначения
1) General subject: Type Codes (пункт в инструкциях, руководствах)4) Engineering: conventions, notation, notation conventions5) Mathematics: conventional signs6) Religion: sigla7) Information technology: convention, notational conventions8) Oil: legend sheet9) Astronautics: nomenclature10) Cartography: map key11) Sakhalin energy glossary: symbol legend12) Makarov: arbitrary notations, conventional notation, key, notation convention13) Gold mining: description14) Microsoft: legend keysУниверсальный русско-английский словарь > условные обозначения
См. также в других словарях:
Ordinal collapsing function — In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger … Wikipedia
Big O notation — In mathematics, big O notation is used to describe the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions. It is a member of a larger family of notations that is… … Wikipedia
arts, East Asian — Introduction music and visual and performing arts of China, Korea, and Japan. The literatures of these countries are covered in the articles Chinese literature, Korean literature, and Japanese literature. Some studies of East Asia… … Universalium
History of mathematics — A proof from Euclid s Elements, widely considered the most influential textbook of all time.[1] … Wikipedia
Wave function — Not to be confused with the related concept of the Wave equation Some trajectories of a harmonic oscillator (a ball attached to a spring) in classical mechanics (A B) and quantum mechanics (C H). In quantum mechanics (C H), the ball has a wave… … Wikipedia
Method of analytic tableaux — A graphical representation of a partially built propositional tableau In proof theory, the semantic tableau (or truth tree) is a decision procedure for sentential and related logics, and a proof procedure for formulas of first order logic. The… … Wikipedia
Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms The Fourier transform is a mathematical operation that decomposes a function into its constituent… … Wikipedia
Document Type Definition — (DTD) is a set of markup declarations that define a document type for SGML family markup languages (SGML, XML, HTML). DTDs were a precursor to XML schema and have a similar function, although different capabilities. DTDs use a terse formal syntax … Wikipedia
Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… … Wikipedia
Special classes of semigroups — In mathematics, a semigroup is a nonempty set together with an associative binary operation. A special class of semigroups is a class of semigroups satisfying additional properties or conditions. Thus the class of commutative semigroups consists… … Wikipedia
Hyperarithmetical theory — In recursion theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second order arithmetic and with weak systems of set theory such as Kripke–Platek set theory. It is an… … Wikipedia